Joint and tandem source-channel coding with complexity and delay constraints

نویسندگان

  • Jongtae Lim
  • David L. Neuhoff
چکیده

Two common source-channel coding strategies, joint and tandem, are compared on the basis of distortion vs. complexity and distortion vs. delay by analyzing specific representatives of each when transmitting analog data samples across a binary symmetric channel. Channel-optimized transform coding is the joint source-channel strategy; transform coding plus Reed-Solomon coding is the tandem strategy. For each strategy, formulas for the mean-squared error, computational complexity and delay are found and used to minimize distortion subject to constraints on complexity and delay, for source data modeled as Gauss-Markov. The results of such optimizations suggest there is a complexity threshold such that when the number of operations per data sample available for encoding and decoding is greater than this threshold, tandem coding is better, and when less, channel-optimized transform coding is better. Similarly, the results suggest there is also a delay threshold such that tandem coding is better than joint when only when the permissible encoding and decoding delay is greater than this threshold.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transmission of Two-tone Images over Noisy Channels with Memory

Source and channel coding are two problems that have traditionally been implemented separately, forming what is known as a tandem source-channel coding system. The separation of channel and source coding is only optimal in an asymptotic sense, i.e., when no constraints exist on the coding block lengths (delay) and on the complexity of the encoder/decoder [1]. Joint source-channel coding, howeve...

متن کامل

Joint and tandem source-channel coding with delay constraints

Two common source-channel coding strategies, joint and tandem, are compared on the basis of distortion vs. delay by analyzing specific representatives of each when transmitting analog data samples across a binary symmetric channel. Channel-optimized transform coding is the joint sourcechannel coding strategy; transform coding with Reed-Solomon coding is the tandem strategy. For each strategy, f...

متن کامل

Source - Channel Mappings with Applications to Compressed Sensing

Tandem source-channel coding is proven to be optimal by Shannon given unlimited delay and complexity in the coders. Under low delay and low complexity constraints, joint source-channel coding may achieve better performance. Although digital joint source-channel coding has shown a noticeable gain in terms of reconstructed signal quality, coding delay, and complexity, it suffers from the leveling...

متن کامل

Error Exponents for Joint Source-Channel Coding with Delay-Constraints

Traditionally, joint source-channel coding is viewed in the block coding context — all the source symbols are known in advance by the encoder. Here, we consider source symbols to be revealed to the encoder in real time and require that they be reconstructed at the decoder within a certain fixed end-to-end delay. We derive upper and lower bounds on the reliability function with delay for cases w...

متن کامل

An Enhanced Joint Source-Channel Decoder

Tandem coding and decoding has been demonstrated to yield arbitrarily low error rates provided a sufficiently large block length is used. When applied to practical systems that are inherently limited to a finite complexity and therefore to finite block lengths, such a strategy may be largely suboptimal. Indeed, a tandem decoding strategy ignores two types of information: the source memory and t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Communications

دوره 51  شماره 

صفحات  -

تاریخ انتشار 2003